An Iterative Method for the Generalized Centro-symmetric Solution of a Linear Matrix Equation Axb + Cy D = E

نویسندگان

  • Ying-chun LI
  • Zhi-hong LIU
چکیده

A matrix P ∈ Rn×n is said to be a symmetric orthogonal matrix if P = P T = P−1. A matrix A ∈ Rn×n is said to be generalized centro-symmetric (generalized central anti-symmetric )with respect to P , if A = PAP (A = −PAP ). In this paper, an iterative method is constructed to solve the generalized centrosymmetric solutions of a linear matrix equation AXB + CY D = E, with real pair matrices X and Y . We show when the matrix equation is consistent over generalized centro-symmetric pair matrices X and Y , for any initial pair matrices X0 and Y0, the generalized centro-symmetric solution can be obtained within finite iterative steps in the absence of roundoff errors, and the minimum norm of the generalized centro-symmetric solutions can be obtained by choosing a special kind of initial pair matrices. Furthermore, the optimal approximation pair solution X̂ and Ŷ to a given matrices X and Y can be derived. 2000 Mathematics Subject Classification: 15A24, 15A57.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Method for Mirror-symmetric Solution of Matrix Equation Axb + Cy D = E

Mirror-symmetric matrices have important applications in studying odd/even-mode decomposition of symmetric multiconductor transmission lines (MTL). In this paper, we propose an iterative algorithm to solve the mirror-symmetric solution of matrix equation AXB + CY D = E. With it, the solvability of the equation over mirror-symmetric X, Y can be determined automatically. When the equation is cons...

متن کامل

A new Approximation to the solution of the linear matrix equation AXB = C

It is well-known that the matrix equations play a significant role in several applications in science and engineering. There are various approaches either direct methods or iterative methods to evaluate the solution of these equations. In this research article, the homotopy perturbation method (HPM) will employ to deduce the approximated solution of the linear matrix equation in the form AXB=C....

متن کامل

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012